Natural Search Pointers – a query formulation method for structured information search

نویسندگان

  • Marek Lipczak
  • James Blustein
  • Evangelos Milios
چکیده

Despite a wide variety of new solutions, structured information search still has only one practical approach – formbased interface. A key limitation of this interface is poor handling of iterative search. While browsing the results users have to memorize all new search constraints, go back to the form, and enter them into the appropriate fields. To overcome this obstacle we created Natural Search Pointers – a structured information search interface, which formulates search queries based on information highlighted by a user while browsing the search results. NSP can be used as an extension of any standard form-based interface for consumer-oriented database search engines. Comparison of traditional form-based interface and its NSP extension shows that in iterative search tasks NSP makes finding information faster and more convenient.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Query Formulation Method for Structured Information Search Natural

Despite a wide variety of new solutions, structured information search still has only one practical approach – formbased interface. A key limitation of this interface is poor handling of iterative search. While browsing the results users have to memorize all new search constraints, go back to the form, and enter them into the appropriate fields. To overcome this obstacle we created Natural Sear...

متن کامل

An Effective Path-aware Approach for Keyword Search over Data Graphs

Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...

متن کامل

Query Architecture Expansion in Web Using Fuzzy Multi Domain Ontology

Due to the increasing web, there are many challenges to establish a general framework for data mining and retrieving structured data from the Web. Creating an ontology is a step towards solving this problem. The ontology raises the main entity and the concept of any data in data mining. In this paper, we tried to propose a method for applying the "meaning" of the search system, But the problem ...

متن کامل

Discovering Popular Clicks\' Pattern of Teen Users for Query Recommendation

Search engines are still the most important gates for information search in internet. In this regard, providing the best response in the shortest time possible to the user's request is still desired. Normally, search engines are designed for adults and few policies have been employed considering teen users. Teen users are more biased in clicking the results list than are adult users. This leads...

متن کامل

Query expansion based on relevance feedback and latent semantic analysis

Web search engines are one of the most popular tools on the Internet which are widely-used by expert and novice users. Constructing an adequate query which represents the best specification of users’ information need to the search engine is an important concern of web users. Query expansion is a way to reduce this concern and increase user satisfaction. In this paper, a new method of query expa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008